package reda.trees;

/**
 * 
 */

/**
 * @author aboukhar
 * http://www.codeproject.com/Articles/68500/Balanced-Binary-Search-Tree-BST-Search-Delete-InOr
 */
public class TestTree {

	/*public void balanceTree(BST tree){
		if ()
	}*/

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		
		BST tree = new BST();
		Node root = new Node(7);
		tree.insert(root,3);
		tree.insert(root, 1);
		tree.insert(root, 8);
		tree.insert(root, 6);
		tree.insert(root, 3);
		tree.insert(root, 9);
		tree.insert(root, 0);
		tree.insert(root, 1);
		tree.insert(root, 7);
		tree.insert(root, 37);
		tree.insert(root, 67);
		//System.out.println(tree.factorial(5));
		//tree.printTreeDiagram(root);
		//tree.breadthTraversal(root);
		tree.printByLevels(root);
	//	System.out.println(tree.getLeftWidth(root));
		// TODO Auto-generated method stub
	
	}
}
